On sampling generating sets of finite groups
نویسندگان
چکیده
The problem of determining the structure of Nk(G) is of interest in several contexts. The counting problem goes back to Philip Hall, who expressed Nk(G) as a Möbius type summation of Nk(H) over all maximal subgroups H ⊂ G (see [23]). Recently the counting problem has been studied for large simple groups where remarkable progress has been made (see [25, 27]). In this paper we analyze Nk for solvable groups and products of simple groups. The sampling problem, while often used in theory as a tool for approximate counting, recently began a life of its own. In this paper we will present an algorithm for exact sampling in case when G is nilpotent. When little about structure of G is known, one can only hope for approximate sampling. In [11] Celler et al. proposed a product replacement Markov chain on Nk(G) which is conjectured to be rapidly mixing to a uniform stationary distribution. The subject was further investigated in [6, 12, 17, 16], while the conjecture is fully established only when G ' Zp, p is a prime. We prove rapid mixing for all abelian groups G. Also, we disprove the folklore conjecture that the group elements in generating k-tuples are (nearly) uniformly distributed. Finally, we would like to remark that the generating k-tuples occur in connection with the so-called random random walks, which are the ordinary random walks on G with random support. The analysis of these “average case” random walks was inspired by Aldous and Diaconis in [1] and was continued in a number of papers (see e.g. [19, 33, 36, 39]). We explain how the sampling problem can be used to test convergence of random random walks.
منابع مشابه
Finite Groups With a Certain Number of Elements Pairwise Generating a Non-Nilpotent Subgroup
متن کامل
Finite Dimensional Generating Spaces of Quasi-Norm Family
In this paper,~some results on finite dimensional generating spaces of quasi-norm family are established.~The idea of equivalent quasi-norm families is introduced.~Riesz lemma is established in this space.~Finally,~we re-define B-S fuzzy norm and prove that it induces a generating space of quasi-norm family.
متن کاملIrredundant Generating Sets of Finite Nilpotent Groups
It is a standard fact of linear algebra that all bases of a vector space have the same cardinality, namely the dimension of the vector space over its base field. If we treat a vector space as an additive abelian group, then this is equivalent to saying that an irredundant generating set for a vector space must have cardinality equal to the dimension of the vector space. The same is not true for...
متن کاملRandom walks on finite rank solvable groups
Abstract. We establish the lower bound p2t(e, e) exp(−t1/3), for the large times asymptotic behaviours of the probabilities p2t(e, e) of return to the origin at even times 2t, for random walks associated with finite symmetric generating sets of solvable groups of finite Prüfer rank. (A group has finite Prüfer rank if there is an integer r , such that any of its finitely generated subgroup admit...
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کامل